Certification for polynomial systems via square subsystems

We consider numerical certification of approximate solutions to a system polynomial equations with more than unknowns by first certifying square subsystem. give several approaches that certifiably select which are the original overdetermined system. These each use different additional information for this certification, such as liaison, Newton-Okounkov bodies, or intersection theory. They may be used certify individual solutions, reject nonsolutions, we have found all solutions.